Construction of System of Spheres-based Transitively Relational Partial Meet Multiple Contractions: An Impossibility Result (Extended Abstract)
نویسندگان
چکیده
In this paper we show that, contrary to what is the case in what concerns contractions by a single sentence, there is not a system of spheres-based construction of multiple contractions which generates each and every transitively relational partial meet multiple contraction. Furthermore, we propose two system of spheresbased constructions of multiple contractions which generate (only) transitively relational partial meet multiple contractions.
منابع مشابه
Transitively Relational Partial Meet Horn Contraction
Following the recent trend of studying the theory of belief revision under the Horn fragment of propositional logic this paper develops a fully characterised Horn contraction which is analogous to the traditional transitively relational partial meet contraction [Alchourrón et al., 1985]. This Horn contraction extends the partial meet Horn contraction studied in [Delgrande and Wassermann, 2010] ...
متن کاملBending Analysis of Rectangular FGM Plates based on the Extended Kantorovich Method
Bending analysis of FGM plates under uniform and sinusoidal loaded result in forth order partial differential equation. In this paper the analytical solution is based on the extended Kantorovich iterative procedure. The differential equations for the iterative procedure is derived using the Galerkin method. The solution was develope based on the classical plate’s theory (CLPT). The reliability ...
متن کاملFixed Point Theorems For Weak Contractions in Dualistic Partial Metric Spaces
In this paper, we describe some topological properties of dualistic partial metric spaces and establish some fixed point theorems for weak contraction mappings of rational type defined on dual partial metric spaces. These results are generalizations of some existing results in the literature. Moreover, we present examples to illustrate our result.
متن کاملWidening Operators for Weakly-Relational Numeric Abstractions (Extended Abstract)
In recent years there has been a lot of interest in the definition of so-called weakly-relational numeric domains, whose complexity and precision are in between the (non-relational) abstract domain of intervals [9] and the (relational) abstract domain of convex polyhedra [10]. The first weakly-relational domain proposed in the literature is based on systems of constraints of the form x−y ≤ c an...
متن کاملar X iv : c s . PL / 0 41 20 43 v 1 1 0 D ec 2 00 4 Widening Operators for Weakly - Relational Numeric Abstractions ⋆ ( Extended Abstract )
In recent years there has been a lot of interest in the definition of so-called weakly-relational numeric domains, whose complexity and precision are in between the (non-relational) abstract domain of intervals [9] and the (relational) abstract domain of convex polyhedra [10]. The first weakly-relational domain proposed in the literature is based on systems of constraints of the form x−y ≤ c an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Artif. Intell.
دوره 233 شماره
صفحات -
تاریخ انتشار 2016